Two-sided context specifications in formal grammars
نویسندگان
چکیده
منابع مشابه
Two-sided context specifications in formal grammars
In a recent paper (M. Barash, A. Okhotin, “An extension of context-free grammars with one-sided context specifications”, Inform. Comput., 2014), the authors introduced an extension of the context-free grammars equipped with an operator for referring to the left context of the substring being defined. This paper proposes a more general model, in which context specifications may be two-sided, tha...
متن کاملAn extension of context-free grammars with one-sided context specifications
The paper introduces an extension of context-free grammars equipped with a quantifier for referring to the left context, in which the substring being defined does occur. For example, a rule A→ a& B defines a string a, as long as it is preceded by any string defined by B. The conjunction operator in this example is taken from conjunctive grammars (Okhotin, 2001), which are an extension of the st...
متن کاملGrammars with two-sided contexts
In a recent paper (M. Barash, A. Okhotin, “Defining contexts in context-free grammars”, LATA 2012), the authors introduced an extension of the context-free grammars equipped with an operator for referring to the left context of the substring being defined. This paper proposes a more general model, in which context specifications may be two-sided, that is, both the left and the right contexts ca...
متن کاملFormal Verification of Object-Oriented Graph Grammars Specifications
Concurrent object-oriented systems are ubiquitous due to the importance of networks and the current demands for modular, reusable, and easy to develop software. However, checking the correctness of such systems is a hard task, mainly due to concurrency and inheritance aspects. In this paper we present an approach to the verification of concurrent object-oriented systems. We use graph grammars e...
متن کاملTwo-dimensional Context-free Grammars
We present a generalization of context-free grammars to twodimensions and define picture languages generated by these grammars. We examine some properties of the formed class and we describe how these languages can be recognized by two-dimensional forgetting au-
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.05.004